Estimating a Largest Eigenvector by Polynomial Algorithms with a Random Start

نویسنده

  • polynomial algorithmsusing Krylov
چکیده

In 7] and 8], the power and Lanczos algorithms with random start for estimating the largest eigenvalue of an n n large symmetric positive deenite matrix were analyzed. In this paper we continue this study by estimating an eigenvector corresponding to the largest eigenvalue. We analyze polynomial algorithms using Krylov information for two error criteria: the randomized error and the randomized residual error. For the randomized error, in contrast to 7] and 8], we prove that it is not possible to get distribution-free bounds. In fact, there exists a matrix for which all polynomial algorithms fail for approximating an eigenvector corresponding to the largest eigenvalue as long as the number of steps is less than n. This shows that the problem of estimating such an eigenvector is much harder than the problem of estimating the largest eigenvalue, and that even the random 1 start does not help. For the randomized error, the bounds must depend on the distribution of eigenvalues of the matrix. For the power algorithm, bounds depending on the ratio of the two largest eigenvalues are presented in 2]. We supply such bounds for the Lanczos algorithm. For the randomized residual error, distribution-free bounds exist and we supply such bounds for the power and Lanczos algorithms. Asymptotic bounds, as well as bounds depending on the ratio of the two largest eigenvalues, are also presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Introduction to Principal Component Analysis and Online Singular Value Decomposition

2.1 Computing Eigenvectors from the Characteristic Polynomial The characteristic polynomial can be used to develop an algorithm for computing the eigenvectors and eigenvalues. This algorithm, which is known as Power Iteration, takes advantage of the property that vectors which are transformed by the matrix A will be scaled in the direction of the largest eigenvector. Initially, the vector is ch...

متن کامل

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...

متن کامل

A tight bound of the largest eigenvalue of sparse random graph

We analyze the largest eigenvalue and eigenvector for the adjacency matrices of sparse random graph. Let λ1 be the largest eigenvalue of an n-vertex graph, and v1 be its corresponding normalized eigenvector. For graphs of average degree d log n, where d is a large enough constant, we show λ1 = d log n + 1 ± o(1) and 〈1, v1〉 = √ n ( 1−Θ ( 1 logn )) . It shows a limitation of the existing method ...

متن کامل

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm

This work provides improved guarantees for streaming principle component analysis (PCA). Given A1, . . . ,An ∈ R sampled independently from distributions satisfying E [Ai] = Σ for Σ 0, this work provides an O(d)-space linear-time single-pass streaming algorithm for estimating the top eigenvector of Σ. The algorithm nearly matches (and in certain cases improves upon) the accuracy obtained by the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996